Multi-Period Maximal Covering Location Problem with Capacitated Facilities and Modules for Natural Disaster Relief Services

The paper aims to study a multi-period maximal covering location problem with the configuration of different types facilities, as an extension classical (MCLP). proposed model can have applications such locating disaster relief hospitals, and chain supermarkets. facilities are supposed be comprised various units, called modules. modules sizes transfer between during planning horizon according demand variation. Both capacitated real-life fact. To solve problem, two upper bounds—(LR1) (LR2)—and Lagrangian decomposition (LD) developed. Two lower bounds computed from feasible solutions obtained (LR1), (LR2), novel heuristic algorithm. results demonstrate that LD method combined bound developed (LD-HLB) shows better performance is preferred both small- large-scale problems in terms tightness efficiency especially for solving problems. generated by solution procedures used profit approximation managerial executives their decision-making process.